Abstract Interpretation with Specialized Definitions

نویسندگان

  • Germán Puebla
  • Elvira Albert
  • Manuel V. Hermenegildo
چکیده

Interpretation with Specialized Definitions Germán Puebla Elvira Albert Manuel V. Hermenegildo School of Computer Science T. U. of Madrid (UPM) 2 School of Computer Science Complutense U. of Madrid Depts. of CS and ECE U. of New Mexico

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generic Framework for the Analysis and Specialization of Logic Programs

The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the partial deduction and abstract interpretation perspectives. In this work we present what we argue is the first fully described generic algorithm for efficient and precise integration of abstract interpretation and partial...

متن کامل

Abstract Interpretation of Non-monotone Bi-inductive Semantic Definitions

Interpretation of Non-monotone Bi-inductive Semantic Definitions ,

متن کامل

Computing Types during Program Specialization

We have developed techniques for obtaining and using type information during program specialization (partial evaluation). Computed along with every residual expression and every specialized program is type information that bounds the possible values that the specialized program will compute at run time. The three keystones of this research are symbolic v&es that represent both the set of values...

متن کامل

A Survey of Shape Analysis Techniques

interpretation is akin to normal program interpretation (i.e execution), but with a specialized operational semantics. The key ideas are (1) to replace concrete program values with abstract values, and (2) to simulate the resulting program under the new operational semantics. Shape analysis algorithms utilize abstract interpretation to compute dataflow relations between the various locations in...

متن کامل

On Polymorphic Recursion, Type Systems, and Abstract Interpretation

The problem of typing polymorphic recursion (i.e., recursive function definitions rec {x = e} where different occurrences of x in e are used with different types) has been investigated both by people working on type systems and by people working on abstract interpretation. Recently, Gori and Levi have developed a family of abstract interpreters that are able to type all the ML typable recursive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006